Hypothetical Temporal Queries in Databases
نویسندگان
چکیده
This paper considers the problem of posing and answering hypothetical temporal queries to databases. The queries are hypothetical in the sense that we pose a query to a virtually updated database, and the query is answered on the basis of the initial, physical database and the list of transactions that virtually update the database. The queries are temporal in the sense that they refer to possibly all the states along which the database evolves from the initial database and the nal virtual state. The possibility of answering such queries relies on a speciication of the dynamics of the database augmented with a spec-iication of the dynamics of auxiliary tables that have their origin in the temporal subfor-mulas of the query and encode the history of the database. Queries are posed in rst order past temporal logic. These functionalities are implemented in SCDBR, an automated rea-soner for speciications of database updates. Although we concentrate mostly on relational databases, the methodology can be applied to other kinds of databases, as deductive and rst order databases. The copyright of this paper belongs to the paper's authors. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage.
منابع مشابه
A Practical Approach to Hypothetical Database Queries
Hypothetical queries are queries embedding hypotheses about the database. The embedded hypothesis in a hypothetical query indicates, so to say, a state of the database intended for the rest of the query. Thus the answer to a hypothetical query h > q, with a hypothesis h, is in principle the result of evaluating q against the database revised with h. In case h is inconsistent with the database, ...
متن کاملA Method for Protecting Access Pattern in Outsourced Data
Protecting the information access pattern, which means preventing the disclosure of data and structural details of databases, is very important in working with data, especially in the cases of outsourced databases and databases with Internet access. The protection of the information access pattern indicates that mere data confidentiality is not sufficient and the privacy of queries and accesses...
متن کاملSupporting temporal text-containment queries in temporal document databases
In temporal document databases and temporal XML databases, temporal text-containment queries are a potential performance bottleneck. In this paper we describe how to manage documents and index structures in such databases in a way that makes temporal textcontainment querying feasible. We describe and discuss different index structures that can improve such queries. Three of the alternatives hav...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملDatabases and Temporal Constraints :
We continue the development of a theory of constraint databases with indeenite information which we originated in our previous research. Initially we review the schemes of L-constraint databases and indeenite L-constraint databases where L, the parameter, is a rst-order constraint language. Then we consider several instances of these schemes where L is a language for expressing information abou...
متن کامل